Towards an Ontology of Approximate Reason
نویسندگان
چکیده
This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an agent. Agents are designed to classify information granules derived from sensors that respond to stimuli in the environment of an agent or received from other agents. Classification of information granules is carried out in the context of parameterized approximation spaces and a calculus of granules. Judgment in agents is a faculty of thinking about (classifying) the particular relative to decision rules derived from data. Judgment in agents is reflective, but not in the classical philosophical sense (e.g., the notion of judgment in Kant). In an agent, a reflective judgment itself is an assertion that a particular decision rule derived from data is applicable to an object (input). That is, a reflective judgment by an agent is an assertion that a particular vector of attribute (sensor) values matches to some degree the conditions for a particular rule. In effect, this form of judgment is an assertion that a vector of sensor values reflects a known property of data expressed by a decision rule. Since the reasoning underlying a reflective judgment is inductive and surjective (not based on a priori conditions or universals), this form of judgment is reflective, but not in the sense of Kant. Unlike Kant, a reflective judgment is surjective in the sense that it maps experimental attribute values onto the most closely This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant 194376 Address for correspondence: Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg Manitoba R3T 5V6 Canada This work was supported by the State Committee for Scientific Research of the Republic of Poland grant 8 T11C 025 19 and by the Wallenberg Foundation grant This work was supported by the State Committee for Scientific Research of the Republic of Poland grant 8 T11C 025 19 This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant 185986 158 J.F. Peters et al. / Towards an Ontology of Approximate Reason matching descriptors (conditions) in a derived rule. Again, unlike Kant’s notion of judgment, a reflective judgment is not the result of searching for a universal that pertains to a particular set of values of descriptors. Rather, a reflective judgment by an agent is a form of recognition that a particular vector of sensor values pertains to a particular rule in some degree. This recognition takes the form of an assertion that a particular descriptor vector is associated with a particular decision rule. These considerations can be repeated for other forms of classifiers besides those defined by decision rules.
منابع مشابه
Maraghe Observatory and an Effort towards Retrieval of Architectural Design of Astronomical Units
Maraghe observatory was built by such engineers as Moayiededdin Orozi etc. under supervision of Khaje Nasireddin Tousi in 7th century AH. The most significant feature associated with Maraghe observatory is the fact that architecture is employed to achieve astronomical purposes in this site. The reason for preferring observatory by astronomers was the fact that these units are superior to wooden...
متن کاملQuery Architecture Expansion in Web Using Fuzzy Multi Domain Ontology
Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملPerformance Heterogeneity and Approximate Reasoning in Description Logic Ontologies
Due to the high worst case complexity of the core reasoning problem for the expressive profiles of OWL 2, ontology engineers are often surprised and confused by the performance behaviour of reasoners on their ontologies. Even very experienced modellers with a sophisticated grasp of reasoning algorithms do not have a good mental model of reasoner performance behaviour. Seemingly innocuous change...
متن کاملHigh Accuracy Relative Motion of Spacecraft Using Linearized Time-Varying J2-Perturbed Terms
This paper presents a set of linearized equations was derived for the motion, relative to an elliptical reference orbit, of an object influenced by J2 perturbation terms. Approximate solution for simulations was used to compare these equations and the linearized keplerian equations to the exact equations. The inclusion of the linearized perturbations in the derived equations increased the high ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 51 شماره
صفحات -
تاریخ انتشار 2002